Privacy beyond Single Sensitive Attribute
نویسندگان
چکیده
Publishing individual specific microdata has serious privacy implications. The k-anonymity model has been proposed to prevent identity disclosure from microdata, and the work on -diversity and t-closeness attempt to address attribute disclosure. However, most current work only deal with publishing microdata with a single sensitive attribute (SA), whereas real life scenarios often involve microdata with multiple SAs that may be multi-valued. This paper explores the issue of attribute disclosure in such scenarios. We propose a method called CODIP (Complete Disjoint Projections) that outlines a general solution to deal with the shortcomings in a naı̈ve approach. We also introduce two measures, Association Loss Ratio and Information Exposure Ratio, to quantify data quality and privacy, respectively. We further propose a heuristic CODIP* for CODIP, which obtains a good trade-off in data quality and privacy. Finally, initial experiments show that CODIP* is practically useful on varying numbers of SAs.
منابع مشابه
Determining t in t-closeness using Multiple Sensitive Attributes
Over the years, t-closeness has been dealt with in great detail in Privacy Preserving Data Publishing and Mining. Other methods like k-anonymity fail in terms of attribute disclosure and background knowledge attack as demonstrated by many papers in this field. l-diversity also fails in case of skewness attack. t-closenesstakes care of all these shortcomings and is the most robust privacy model ...
متن کاملt-Closeness: Privacy Beyond k-Anonymity and `-Diversity
The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to certain “identifying” attributes) contains at least k records. Recently, several authors have recognized that k-anonymity cannot prevent attribute disclosure. The notion of `-diversity has been proposed to address th...
متن کاملA Novel Anonymity Algorithm for Privacy Preserving in Publishing Multiple Sensitive Attributes
Publishing the data with multiple sensitive attributes brings us greater challenge than publishing the data with single sensitive attribute in the area of privacy preserving. In this study, we propose a novel privacy preserving model based on k-anonymity called (α, β, k)-anonymity for databases. (α, β, k)anonymity can be used to protect data with multiple sensitive attributes in data publishing...
متن کاملMultiple Sensitive Attributes based Privacy Preserving Data Mining using k-Anonymity
Data mining is the process of extracting interesting patterns or knowledge from large amount of data. With the development of Data mining technology, an increasing number of data can be mined out to reveal some potential information about the user, because of which privacy of the user may be violated easily. Privacy Preserving Data Mining is used to mine the potential valuable knowledge without...
متن کاملBrowse searchable encryption schemes: Classification, methods and recent developments
With the advent of cloud computing, data owners tend to submit their data to cloud servers and allow users to access data when needed. However, outsourcing sensitive data will lead to privacy issues. Encrypting data before outsourcing solves privacy issues, but in this case, we will lose the ability to search the data. Searchable encryption (SE) schemes have been proposed to achieve this featur...
متن کامل